import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;

public class CharSort {
    /**
     * 3. 无重复字符的最长子串
     *
     * @param s1
     * @param s2
     * @return
     */
    public boolean getChar(String s1,String s2){
        int n=s1.length();
        int m=s2.length();
        int[] s1s=new int[26];
        int[] s2s=new int[26];
        for (int i = 0; i <n ; i++) {
            ++s1s[s1.charAt(i)-'a'];
            ++s2s[s2.charAt(i)-'a'];
        }
        if(Arrays.equals(s2s,s1s)){
            return true;
        }
        for (int i = n; i <m ; i++) {
            ++s2s[s2.charAt(i)-'a'];
            --s1s[s2.charAt(i-n)-'a'];
            if(Arrays.equals(s2s,s1s)){
                return true;
            }
        }

        return false;
    }

    public static void main(String[] args) {
        int a=1;
        a+='a';
        System.out.println(a);
    }
}
